an improved wagner-whitin algorithm

نویسندگان

s. j sadjadi

mir.b.gh. aryanezhad

h.a. sadeghi

چکیده

we present an improved implementation of the wagner-whitin algorithm for economic lot-sizing problems based on the planning-horizon theorem and the economic- part-period concept. the proposed method of this paper reduces the burden of the computations significantly in two different cases. we first assume there is no backlogging and inventory holding and set-up costs are fixed. the second model of this paper considers wwa when backlogging, inventory holding and set-up costs cannot be fixed. the preliminary results also indicate that the execution time for the proposed method is approximately linear in the number of periods in the planning-horizon .

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved WAGNER-WHITIN Algorithm

We present an improved implementation of the Wagner-Whitin algorithm for economic lot-sizing problems based on the planning-horizon theorem and the Economic- Part-Period concept. The proposed method of this paper reduces the burden of the computations significantly in two different cases. We first assume there is no backlogging and inventory holding and set-up costs are fixed. The second model ...

متن کامل

Robust Wagner–Whitin algorithm with uncertain costs

In real-world applications, costs for products are not deterministic: neither static nor dynamic. They actually tend to be non-stationary and cross-correlated. To overcome this drawback, there have been some efforts by researchers to extend the Wagner–Whitin algorithm to consider stochastic costs. However, they assume that the information of probability density function of random costs exists. ...

متن کامل

On the Wagner-Whitin Lot-Sizing Polyhedron

We study a family of unbounded polyhedra arising in the study of uncapacitated lot-sizing problems with Wagner-Whitin costs. With n the number of periods, we completely characterize the bounded faces of maximal dimension, and derive an O(n) algorithm to express any point within the polyhedron as a convex combination of extreme points and extreme rays. We also study adjacency on the polyhedra, a...

متن کامل

Worst Case Analysis of Forward Wagner Whitin Algorithm with Rolling Horizons

In this paper, we analyze the performance guarantee of the forward Wagner-Whitin algorithm with rolling horizons. We establish several properties for the solution returned by the algorithm and show that the ratio of the heuristic solution to the optimal cost is bounded above by the degree of speculative motive. Further, we show that the bound is actually tight.

متن کامل

Echelon Stock Formulation of Arborescent Distribution Systems: An Application to the Wagner-Whitin Problem

An arborescent distribution system is a multi-level system in which each installation receives input from a unique immediate predecessor and supplies one or more immediate successors. In this paper, it is shown that a distribution system with an arborescent structure can also be modelled using an echelon stock concept where at any instant the total echelon holding cost is accumulated at the sam...

متن کامل

An Improved Algorithm for Network Reliability Evaluation

Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
international journal of industrial engineering and productional research-

جلد ۲۰، شماره ۳، صفحات ۱۱۷-۱۲۳

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023